591 - Box of bricks/Intentando ayudar/tarif.cpp

   1 #include <stdio.h>
   2 #include <assert.h>
   3
   4 int array[100];
   5
   6 int main(void)
   7
   8 {
   9   int n, h,l_1,l_2,set=0,num_bricks=0,bricks_pwal,move=0;
  10
  11   for( ; ; )
  12   {
  13     scanf("%d", &n);
  14     if(n==0)
  15     {
  16       return 0;
  17     }
  18     set++;
  19     assert(n>=1 && n<=50);
  20     {
  21        /*will the set increase here or before :( */
  22       for(l_1=0;l_1<n;l_1++)
  23       {
  24           scanf("%d", &h);
  25               while(h<=0 || h>100)
  26                 {
  27                   scanf("%d",&h);
  28                 }
  29
  30               /*assert(ch=='@' || ch=='*');*/
  31               array[l_1] = h;
  32               num_bricks +=h;
  33       }
  34
  35       if(num_bricks%n==0)
  36       {
  37               bricks_pwal = num_bricks/n;
  38
  39               for(l_2=0;l_2<n;l_2++)
  40               {
  41                 if(bricks_pwal-array[l_2]>0)
  42                 {
  43                   move += bricks_pwal-array[l_2];
  44                 }
  45                }
  46       }
  47
  48       printf("Set #%d\n", set);
  49       printf("The minimum number of moves is %d.\n\n", move);
  50
  51       move = 0;
  52       num_bricks = 0;
  53     }
  54    }
  55
  56    /*return 0;*/
  57 }
  58